An Efficient Method for Compressing Test Data

نویسندگان

  • Takahiro J. Yamaguchi
  • Masahiro Ishida
  • Marco Tilgner
  • Dong Sam Ha
چکیده

The overall throughput of automatic test equipment (ATE) is sensitive to the download time of test data. An effective approach to the reduction of the download time is to compress test data before the download. A compression algorithm for test data should meet two requirements: lossless and simple decompression. In this paper, we propose a new test data compression method that aims to fully utilize the unique characteristics of test data compression. The key idea of the proposed method is to perform the Burrows-Wheeler transformation on the sequence of test patterns, and then to apply run-length coding. The experimental results show that our compression method performs better than six other methods for compressing test data. The average compression ratio of the proposed method performed on five test data sets is 315, while that for the next best one, the LZW method, is 21.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A crack localization method for beams via an efficient static data based indicator

In this paper, a crack localization method for Euler-Bernoulli beams via an efficient static data based indicator is proposed. The crack in beams is simulated here using a triangular variation in the stiffness. Static responses of a beam are obtained by the finite element modeling. In order to reduce the computational cost of damage detection method, the beam deflection is fitted through a poly...

متن کامل

An Algebraic Method for Compressing Very Large Symbolic Data Tables

Although symbolic data tables summarize huge sets of data they can still become very large in size. This paper proposes a method for compressing a symbolic data table using the recently emerged Compound Term Composition Algebra. One charisma of CTCA is that the closed world hypotheses of its operations can lead to a remarkably high ”compression ratio”. The compacted form apart from having much ...

متن کامل

An algebraic method for compressing symbolic data tables

Although symbolic data tables summarize huge sets of data they can still become very large in size. This paper proposes a novel technique for compressing a symbolic data table using the recently emerged Compound Term Composition Algebra. One advantage of CTCA is that the closed world hypotheses of its operations can lead to a remarkably high ”compression ratio”. The compacted form apart from ha...

متن کامل

A Method for Compressing Test Data Based on Burrows-Wheeler Transformation

ÐThe overall throughput of automatic test equipment (ATE) is affected by the download time of test data. An effective approach to the reduction of the download time is to compress test data before the download. A compression algorithm for test data should meet two requirements: lossless and simple decompression. In this paper, we propose a new test data compression method that aims to fully uti...

متن کامل

COMPACT: A Hybrid Method for Compressing Test Data

The overall throughput of automatic test equipment (ATE) is sensitive to the download time of test data. An effective approach to the reduction of the download time is to compress test data before the download. The authors introduced a test data compression method which outperforms other methods for compressing test data [8]. Our previous method is based on the Burrows-Wheeler transformation on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997